The Olympic Medals Ranks, Lexicographic Ordering, and Numerical Infinities
نویسندگان
چکیده
منابع مشابه
The Olympic Medals Ranks, lexicographic ordering and numerical infinities
Several ways used to rank countries with respect to medals won during Olympic Games are discussed. In particular, it is shown that the unofficial rank used by the Olympic Committee is the only rank that does not allow one to use a numerical counter for ranking – this rank uses the lexicographic ordering to rank countries: one gold medal is more precious than any number of silver medals and one ...
متن کاملOlympic medals or long life: what's the bottom line?
On a per capita basis, Australia spent more than seven times as much on its Sydney Olympic team as did Canada, to win four times as many medals. Compared with Australia, Canada spent an additional amount per capita (standardised to the purchasing power parity rate at year 2000) of US dollars 1605 per life-year gained on healthcare in 2000. Neither country is "right" or "wrong" in making these f...
متن کاملOlympic Medals, Economy, Geography and Politics from Sydney to Rio
T he paper uses Heckman model to examine the statistical importance of over 140 independent variables on the Olympic performance of all countries participating in the Summer Olympic Games from Sydney 2000 to Rio 2016. We find that countries which export more products have a higher likelihood of winning an Olympic medal than their counterparts exporting fewer products, and explain why...
متن کاملThe Light Lexicographic path Ordering
We introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering. We show that the light lexicographic path ordering leads to a characterisation of the functions computable in space bounded by a polynomial in the size of the inputs.
متن کاملRevisiting the Lexicographic Ordering Constraint
We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of n variables. The algorithm maintains arcconsistency, runs in O(n) time on posting plus amortized O(1) time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm was derived from a finite automaton operating on a string which ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematical Intelligencer
سال: 2015
ISSN: 0343-6993,1866-7414
DOI: 10.1007/s00283-014-9511-z